Solving Cardinality Constraints in ( Constraint )
نویسنده
چکیده
منابع مشابه
رویکردی فراابتکاری برای انتخاب سبد سهام با اهداف چندگانه در بورس اوراق بهادار تهران
This paper presents a novel metaheuristic method for solving an extended Markowitz portfolio selection model. In the extended model, the objective function has been modified to include realistic objectives and four additional sets of constraints, i.e., bounds on holdings, cardinality, minimum transaction lots, and liquidity constraints have been also included. The first set of constraints gua...
متن کاملIncremental Encoding and Solving of Cardinality Constraints
Traditional SAT-based MaxSAT solvers encode cardinality constraints directly as part of the CNF and solve the entire optimization problem by a sequence of iterative calls of the underlying SAT solver. The main drawback of such approaches is their dependence on the number of soft clauses: The more soft clauses the MaxSAT instance contains, the larger is the CNF part encoding the cardinality cons...
متن کاملLearning Implied Global Constraints
Finding a constraint network that will be efficiently solved by a constraint solver requires a strong expertise in Constraint Programming. Hence, there is an increasing interest in automatic reformulation. This paper presents a general framework for learning implied global constraints in a constraint network assumed to be provided by a non-expert user. The learned global constraints can then be...
متن کاملA Cardinality Solver: More Expressive Constraints for Free - (Poster Presentation)
Despite the semantic simplicity of cardinality constraints, the CNF encodings typically used to solve them invariably turn one constraint into a large number of CNF clauses and/or auxiliary variables. This incurs a significant cost, both in space complexity and in runtime, that could be avoided by reasoning about cardinality constraints directly within a solver. Adding a single, native cardi-na...
متن کاملMechanisms for Reasoning about Sets
The SEt Reasoning Facility (SERF) integrates mechanisms for propagating membership propositions, deriving relations between sets, and reasoning about closure and cardinality into an efficient utility package for reasoning about sets. Assertions about relations between sets are compiled into a constraint network defined entirely in terms of union, complement, and emptiness constraints. The const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001